Research on the Time-Dependent Split Delivery Green Vehicle Routing Problem for Fresh Agricultural Products with Multiple Time Windows
نویسندگان
چکیده
Due to the diversity and different distribution conditions of agricultural products, split delivery plays an important role in last mile products distribution. The time-dependent green vehicle routing problem with multiple time windows (TDSDGVRPMTW) is studied by considering both economic cost customer satisfaction. A calculation method for road travel across periods was designed. satisfaction measure function based on a window employed time-varying speeds, fuel consumption, carbon emissions customers’ windows. object TDSDGVRPMTW model minimize sum maximize average According characteristics model, variable neighborhood search combined non-dominated sorting genetic algorithm II (VNS-NSGA-II) Finally, experimental data show that proposed approaches effectively reduce total costs promote energy conservation
منابع مشابه
THE PERIODIC GREEN VEHICLE ROUTING PROBLEM WITH CONSIDERING OF TIME-DEPENDENT URBAN TRAFFIC AND TIME WINDOWS
The travel times among demand points are strongly influenced by traffic in a supply chain. Due to this fact, the service times for customers are variable. For this reason, service time is often changes over a time interval in a real environment. In this paper, a time-dependent periodic green vehicle routing problem (VRP) considering the time windows for serving the customers and multiple trip i...
متن کاملCompetitive Vehicle Routing Problem with Time Windows and Stochastic Demands
The competitive vehicle routing problem is one of the important issues in transportation area. In this paper a new method for competitive VRP with time windows and stochastic demand is introduced. In the presented method a three time bounds are given and the probability of arrival time between each time bound is assumed to be uniform. The demands of each customer are different in each time wind...
متن کاملAcceleration of Lagrangian Method for the Vehicle Routing Problem with Time Windows
The analytic center cutting plane method (ACCPM) is one of successful methods to solve nondifferentiable optimization problems. In this paper ACCPM is used for the first time in the vehicle routing problem with time windows (VRPTW) to accelerate lagrangian relaxation procedure for the problem. At first the basic cutting plane algorithm and its relationship with column generation method is clari...
متن کاملA green perspective on capacitated time-dependent vehicle routing problem with time windows
This study presents a novel approach to the vehicle routing problem by focusing on greenhouse gas emissions and fuel consumption aiming to mitigate adverse environmental effects of transportation. A time-dependent model with time windows is developed to incorporate speed and schedule in transportation. The model considers speed limits for different times of the day in a realistic delivery conte...
متن کاملVehicle routing problem with time-windows for perishable food delivery
This study has extended a vehicle routing problem, with time-windows (VRPTW), by considering the randomness of the perishable food delivery process, and constructing a SVRPTWmodel, to obtain optimal delivery routes, loads, fleet dispatching and departure times for delivering perishable food from a distribution center. Our objective was to minimize not only the fixed costs for dispatching vehicl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Agriculture
سال: 2022
ISSN: ['2077-0472']
DOI: https://doi.org/10.3390/agriculture12060793